Categorifications of the chromatic polynomial
نویسنده
چکیده
We will discuss different categorifications of the chromatic polynomial, how they are related to each other as well as how they relate to the Hochschild homology of algebras and Khovanov link homology.
منابع مشابه
New Categorifications of the Chromatic and the Dichromatic Polynomials for Graphs
In this paper, for each graphG, we define a chain complex of graded modules over the ring of polynomials, whose graded Euler characteristic is equal to the chromatic polynomial of G. We also define a chain complex of doubly graded modules, whose (doubly) graded Euler characteristic is equal to the dichromatic polynomial of G. Both constructions use Koszul complexes, and are similar to the new K...
متن کاملChromatic polynomials of some nanostars
Let G be a simple graph and (G,) denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.
متن کاملA new result on chromaticity of K4-homoemorphs with girth 9
For a graph $G$, let $P(G,lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if any graph chromatically equivalent to $G$ is isomorphic to $G$. A $K_4$-homeomorph is a subdivision of the complete graph $K_4$. In this paper, we determine a family of chromatically uni...
متن کاملOn two categorifications of the arrow polynomial for virtual knots
Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an integer arrow number calculated from each loop in an oriented state summation for the bracket. The categorifications are based on new gradings associated wi...
متن کاملOn the Roots of Hosoya Polynomial of a Graph
Let G = (V, E) be a simple graph. Hosoya polynomial of G is d(u,v) H(G, x) = {u,v}V(G)x , where, d(u ,v) denotes the distance between vertices u and v. As is the case with other graph polynomials, such as chromatic, independence and domination polynomial, it is natural to study the roots of Hosoya polynomial of a graph. In this paper we study the roots of Hosoya polynomials of some specific g...
متن کامل